On Solving Nominal Disunification Constraints
نویسندگان
چکیده
منابع مشابه
On Solving Nominal Fixpoint Equations
In nominal syntax, variable binding is specified using atomabstraction constructors, and alpha-equivalence is formalised using fresh-ion constructors, and alpha-equivalence is formalised using freshness constraints and atom swappings, which implement variable renamings. Composition of swappings gives rise to atom permutations. Algorithms to check equivalence, match and unify nominal terms have ...
متن کاملSolving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors....
متن کاملAsymmetric Unification and Disunification
We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the right-hand sides of the equations are in normal form with respect to the given term rewriting system. In Disunification we solve equations and disequations with respect to an equational theory....
متن کاملEquational Problems and Disunification
Roughly speaking, an equational problem is a first order formula whose only predicate symbol is =. We propose some rules for the transformation of equational problems and study their correctness in various models. Then, we give completeness results with respect to some “simple” problems called solved forms. Such completeness results still hold when adding some control which moreover ensures ter...
متن کاملOn Solving Boolean Combinations of UTVPI Constraints
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two variables with non-zero coefficients, where furthermore those coefficients must be either −1 or 1. We prove that if a satisfying solution exists, then there is a solution with each variable taking values in [−n · ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2020
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2020.02.002